Chords of longest circuits in locally planar graphs
نویسندگان
چکیده
منابع مشابه
Chords of longest circuits in locally planar graphs
It was conjectured by Thomassen ([B. Alspach, C. Godsil, Cycle in graphs, Ann. Discrete Math. 27 (1985)], p. 466) that every longest circuit of a 3-connected graph must have a chord. This conjecture is verified for locally 4-connected planar graphs, that is, let N be the set of natural numbers; then there is a function h : N → N such that, for every 4-connected graph G embedded in a surface S w...
متن کاملChords of longest circuits in 3-connected graphs
Thomassen conjectured that every longest circuit of a 3-connected graph has a chord. The conjecture is veri2ed in this paper for projective planar graphs with minimum degree at least 4. c © 2002 Elsevier Science B.V. All rights reserved.
متن کاملChords of Longest Cycles in Cubic Graphs
We describe a general sufficient condition for a Hamiltonian graph to contain another Hamiltonian cycle. We apply it to prove that every longest cycle in a 3-connected cubic graph has a chord. We also verify special cases of an old conjecture of Sheehan on Hamiltonian cycles in 4-regular graphs and a recent conjecture on a second Hamiltonian cycle by Triesch, Nolles, and Vygen. 1997 Academic Press
متن کاملChords of longest circuits of graphs embedded in torus and Klein bottle
Thomassen conjectured that every longest circuit of a 3connected graph has a chord. It is proved in this paper that every longest circuit of a 4-connected graph embedded in a torus or Klein bottle has a chord. 2003 Wiley Periodicals, Inc. J Graph Theory 43: 1–23, 2003
متن کاملHamilton Cycles in Planar Locally Finite Graphs
A classical theorem by Tutte assures the existence of a Hamilton cycle in every finite 4-connected planar graph. Extensions of this result to infinite graphs require a suitable concept of an infinite cycle. Such a concept was provided by Diestel and Kühn, who defined circles to be homeomorphic images of the unit circle in the Freudenthal compactification of the (locally finite) graph. With this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2007
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2005.07.017